﻿#include"RBTree.h"
#include"AVLTree.h"

// 测试代码
void TestRBTree1()
{
	RBTree<int, int> t;
	// 常规的测试⽤例
	//int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	// 
	// 特殊的带有双旋场景的测试⽤例
	int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };

	for (auto e : a)
	{
		t.Insert({ e, e });
	}

	t.InOrder();
	cout << t.IsBalance() << endl;
}
// 插⼊⼀堆随机值，测试平衡，顺便测试⼀下⾼度和性能等
void TestRBTree2()
{
	const int N = 100000;
	vector<int> v;
	v.reserve(N);
	srand(time(0));

	for (size_t i = 0; i < N; i++)
	{
		v.push_back(rand() + i);
	}

	size_t begin2 = clock();
	AVLTree<int, int> t;

	for (auto e : v)
	{
		t.Insert(make_pair(e, e));
	}

	size_t end2 = clock();

	size_t begin22 = clock();
	RBTree<int, int> rbt;

	for (auto e : v)
	{
		rbt.Insert(make_pair(e, e));
	}

	size_t end22 = clock();
	cout << endl;
	cout << "AVL Insert:" << end2 - begin2 << endl;
	cout << "RB Insert:" << end22 - begin22 << endl;

	cout << "AVL IsBalance:" << t.IsBalanceTree() << endl;
	cout << "RB IsBalance:" << rbt.IsBalance() << endl;

	cout << "AVL Height:" << t.Height() << endl;
	cout << "AVL Size:" << t.Size() << endl;
	
	cout << "RB Height:" << rbt.Height() << endl;
	cout << "RB Size:" << rbt.Size() << endl;

	
	size_t begin1 = clock();

	// 确定在的值
	/*for (auto e : v)
	{
	t.Find(e);
	}*/

	// 随机值
	for (size_t i = 0; i < N; i++)
	{
		t.Find((rand() + i));
	}

	size_t end1 = clock();
	cout << "AVL Find:" << end1 - begin1 << endl;

	size_t begin11 = clock();

	// 确定在的值
	/*for (auto e : v)
	{
	rbt.Find(e);
	}*/

	// 随机值
	for (size_t i = 0; i < N; i++)
	{
		rbt.Find((rand() + i));
	}

	size_t end11 = clock();
	cout << "RB Find:" << end11 - begin11 << endl;
}

int main()
{
	TestRBTree1();
	TestRBTree2();

	return 0;
}
